Alignment based Network Coding for Two-Unicast-Z Networks

In this paper, we study the wireline two-unicast-Z communication network over directed acyclic graphs. The two-unicast-Z network is a two-unicast network where the destination intending to decode the second message has apriori side information of the first message. We make three contributions in this paper: 1. We describe a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs. Our approach includes the idea of interference alignment as one of its key ingredients. For graphs of a bounded degree, our algorithm has linear complexity in terms of the number of vertices, and polynomial complexity in terms of the number of edges. 2. We prove that our algorithm achieves the rate-pair (1, 1) whenever it is feasible in the network. Our proof serves as an alternative, albeit restricted to two-unicast-Z networks over directed acyclic graphs, to an earlier result of Wang et al. which studied necessary and sufficient conditions for feasibility of the rate pair (1, 1) in two-unicast networks. 3. We provide a new proof of the classical max-flow min-cut theorem for directed acyclic graphs.Comment: The paper is an extended version of our earlier paper at ITW 201

Joint Coding and Scheduling Optimization in Wireless Systems with Varying Delay Sensitivities

Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications.We investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In the single receiver case, we demonstrate the trade-off between average packet delay, which we view as the inverse of throughput, and maximum ordered inter-arrival delay for various system parameters. For a single broadcast channel with multiple receivers having different delay constraints and feedback delays, we jointly optimize the coding parameters and time-division scheduling parameters at the transmitters. We formulate the optimization problem as a Generalized Geometric Program (GGP). This approach allows the transmitters to adjust adaptively the coding and scheduling parameters for efficient allocation of network resources under varying delay constraints. In the case where the receivers are served by multiple non-interfering wireless broadcast channels, the same optimization problem is formulated as a Signomial Program, which is NP-hard in general. We provide approximation methods using successive formulation of geometric programs and show the convergence of approximations.Comment: 9 pages, 10 figure

Coding and scheduling optimization over packet erasure broadcast channels

Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012.Cataloged from PDF version of thesis.Includes bibliographical references (p. 93-97).Throughput and per-packet delay can present strong trade-offs that are important in the cases of delay sensitive applications. In this thesis, we investigate such trade-offs using a random linear network coding scheme for one or more receivers in single hop wireless packet erasure broadcast channels. We capture the delay sensitivities across different types of network applications using a class of delay metrics based on the norms of packet arrival times. With these delay metrics, we establish a unified framework to characterize the rate and delay requirements of applications and optimize system parameters. In the single receiver case, we demonstrate the trade-off between average packet delay, which we view as the inverse of throughput, and maximum ordered inter-arrival delay for various system parameters. For a single broadcast channel with multiple receivers having different delay constraints and feedback delays, we jointly optimize the coding parameters and time-division scheduling parameters at the transmitters. We formulate the optimization problem as a Generalized Geometric Program (GGP). This approach allows the transmitters to adjust adaptively the coding and scheduling parameters for efficient allocation of network resources under varying delay constraints. In the case where the receivers are served by multiple non-interfering wireless broadcast channels, the same optimization problem is formulated as a Signomial Program, which is NP-hard in general. We provide approximation methods using successive formulation of geometric programs and show the convergence of approximations. Practical issues of implementing proposed coding and optimization scheme on existing layered network architecture are also discussed.by Weifei Zeng.S.M

Sparse Network Coding with Overlapping Classes

This paper presents a novel approach to network coding for distribution of large files. Instead of the usual approach of splitting packets into disjoint classes (also known as generations) we propose the use of overlapping classes. The overlapping allows the decoder to alternate between Gaussian elimination and back substitution, simultaneously boosting the performance and reducing the decoding complexity. Our approach can be seen as a combination of fountain coding and network coding. Simulation results are presented that demonstrate the promise of our approach.Comment: 15 pages, 5 figures, to be published at NetCod 200

Multi-Path TCP with Network Coding for Mobile Devices in Heterogeneous Networks

Existing mobile devices have the capability to use multiple network technologies simultaneously to help increase performance; but they rarely, if at all, effectively use these technologies in parallel. We first present empirical data to help understand the mobile environment when three heterogeneous networks are available to the mobile device (i.e., a WiFi network, WiMax network, and an Iridium satellite network). We then propose a reliable, multi-path protocol called Multi-Path TCP with Network Coding (MPTCP/NC) that utilizes each of these networks in parallel. An analytical model is developed and a mean-field approximation is derived that gives an estimate of the protocol's achievable throughput. Finally, a comparison between MPTCP and MPTCP/NC is presented using both the empirical data and mean-field approximation. Our results show that network coding can provide users in mobile environments a higher quality of service by enabling the use of multiple network technologies and the capability to overcome packet losses due to lossy, wireless network connections.United States. Dept. of Defense. Assistant Secretary of Defense for Research & Engineering (Air Force Contract FA8721-05-C-0002

Activation of PI3K/AKT and ERK MAPK signal pathways is required for the induction of lytic cycle replication of Kaposi's Sarcoma-associated herpesvirus by herpes simplex virus type 1

<p>Abstract</p> <p>Background</p> <p>Kaposi's sarcoma-associated herpesvirus (KSHV) is causally linked to several acquired immunodeficiency syndrome-related malignancies, including Kaposi's sarcoma (KS), primary effusion lymphoma (PEL) and a subset of multicentric Castleman's disease. Regulation of viral lytic replication is critical to the initiation and progression of KS. Recently, we reported that herpes simplex virus type 1 (HSV-1) was an important cofactor that activated lytic cycle replication of KSHV. Here, we further investigated the possible signal pathways involved in HSV-1-induced reactivation of KSHV.</p> <p>Results</p> <p>By transfecting a series of dominant negative mutants and protein expressing constructs and using pharmacologic inhibitors, we found that either Janus kinase 1 (JAK1)/signal transducer and activator of transcription 3 (STAT3) or JAK1/STAT6 signaling failed to regulate HSV-1-induced KSHV replication. However, HSV-1 infection of BCBL-1 cells activated phosphatidylinositol 3-kinase (PI3K)/protein kinase B (PKB, also called AKT) pathway and inactivated phosphatase and tensin homologue deleted on chromosome ten (PTEN) and glycogen synthase kinase-3β (GSK-3β). PTEN/PI3K/AKT/GSK-3β pathway was found to be involved in HSV-1-induced KSHV reactivation. Additionally, extracellular signal-regulated protein kinase (ERK) mitogen-activated protein kinase (MAPK) pathway also partially contributed to HSV-1-induced KSHV replication.</p> <p>Conclusions</p> <p>HSV-1 infection stimulated PI3K/AKT and ERK MAPK signaling pathways that in turn contributed to KSHV reactivation, which provided further insights into the molecular mechanism controlling KSHV lytic replication, particularly in the context of HSV-1 and KSHV co-infection.</p

pH-sensitive charge-conversion cinnamaldehyde polymeric prodrug micelles for effective targeted chemotherapy of osteosarcoma in vitro

Introduction: Chemotherapy is a common strategy for the treatment of osteosarcoma. However, its therapeutic efficacy is not ideal due to the low targeting, lowbioavailability, and high toxicity of chemotherapy drugs. Nanoparticles can improve the residence time of drugs at tumor sites through targeted delivery. This new technology can reduce the risk to patients and improve survival rates. To achieve this goal, we developed a pHsensitive charge-conversion polymeric micelle [mPEG-b-P(C7-co-CA) micelles] for osteosarcoma-targeted delivery of cinnamaldehyde (CA).Methods: First, an amphiphilic cinnamaldehyde polymeric prodrug [mPEG-b-P(C7-co-CA)] was synthesized through Reversible Addition-Fragmentation Chain Transfer Polymerization (RAFT) polymerization and post-modification, and self-assembled into mPEG-b-P(C7-co-CA) micelles in an aqueous solution. The physical properties of mPEG-b-P(C7-co-CA) micelles, such as critical micelle concentration (CMC), size, appearance, and Zeta potential were characterized. The CA release curve of mPEG-b-P(C7-co-CA) micelles at pH 7.4, 6.5 and 4.0 was studied by dialysis method, then the targeting ability of mPEG-b-P(C7-co-CA) micelles to osteosarcoma 143B cells in acidic environment (pH 6.5) was explored by cellular uptakeassay. The antitumor effect of mPEG-b-P(C7-co-CA) micelles on 143B cells in vitro was studied by MTT method, and the level of reactive oxygen species (ROS) in 143B cells after mPEG-b-P(C7-co-CA) micelles treatment was detected. Finally, the effects of mPEG-b-P(C7-co-CA) micelles on the apoptosis of 143B cells were detected by flow cytometry and TUNEL assay.Results: An amphiphilic cinnamaldehyde polymeric prodrug [mPEG-b-P(C7-co-CA)] was successfully synthesized and self-assembled into spheric micelles with a diameter of 227 nm. The CMC value of mPEG-b-P(C7-co-CA) micelles was 25.2 mg/L, and it showed a pH dependent release behavior of CA. mPEG-b-P(C7-co-CA) micelles can achieve chargeconversion from a neutral to a positive charge with decreasing pHs. This charge-conversion property allows mPEG-b-P(C7-co-CA) micelles to achieve 143B cell targeting at pH 6.5. In addition, mPEG-b-P(C7-co-CA) micelles present high antitumor efficacy and intracellular ROS generation at pH 6.5 which can induce 143B cell apoptosis.Discussion: mPEG-b-P(C7-co-CA) micelles can achieve osteosarcoma targeting effectively and enhance the anti-osteosarcoma effect of cinnamaldehyde in vitro. This research provides a promising drug delivery system for clinical application and tumor treatment

Linear algebraic approaches to coding for multiple unicast networks

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2016.Cataloged from PDF version of thesis.Includes bibliographical references (pages 161-167).The multiple unicast network coding problem is a classical open problem in network information theory, whose applications rapidly increase especially with the occurrences in models of distributed storage and content delivery systems. In this thesis, we explore the ideas of linear algebraic techniques and algorithms in the multiple unicast scenarios. In particular, we are interested in wireline networks that are representable as directed acyclic graphs, especially in the context of capacity characterization and achievable coding schemes of two-unicast communications, as two-unicast models capture the complexity of general multiple unicast networks. The results of the thesis are categorized into three main areas that aligned with main intuition behind our approaches. We start with careful examination of the algebraic framework of network coding, which forms the foundation of many important theoretic and practical network coding results. Our results on atomic decomposition of network transfer matrix and the edge reduction lemma substantiate the original algebraic framework proposed in [1], further facilitating its application in the non-multicast scenarios. We dissect the transfer matrices - the most important entities in the network coding framework to bring new tools and concepts into the algebraic framework of network coding. Next, utilizing these linear algebraic tools and concepts, combined with insights from interference channels, we construct achievable regions for two-unicast networks and make connections between ranks of transfer matrices and graph theoretic entities. We highlight various achievable schemes based on the linear algebraic scheme. In particular, making use of the connections between rates and ranks of the transfer matrices, we are able to fully characterize some achievable regions using various minimum cut set values between the sources and destinations. Finally the cascaded decomposition of transfer matrices also allows us adopt a dynamic programming approach to coding for these networks. We revisit the original settings of the max-flow min-cut theorem and provide an alternative proof that is based purely on linear algebraic coding constructions. Using the same intuition, we devise a recurisve coding algorithm for two-unicast-Z networks. We hope that our approaches do not only help making progress in the core problem of multiple unicasts, but also provide some novel perspectives to other tightly connected problems, such as coding for distributed storage and index coding.by Weifei Zeng.Ph. D

A recursive coding algorithm for two-unicast-Z networks

We derive a new linear network coding algorithm for two-unicast-Z networks over directed acyclic graphs, that is, for two-unicast networks where one destination has apriori information of the interfering source message. Our algorithm discovers linear network codes for two-unicast-Z networks by combining ideas of random linear network coding and interference neutralization. We show that our algorithm outputs an optimal network code for networks where there is only one edge emanating from each of the two sources. The complexity of our algorithm is polynomial in the number of edges of the graph

The Role of Extracellular Vesicles in Osteoporosis: A Scoping Review

As an insidious metabolic bone disease, osteoporosis plagues the world, with high incidence rates. Patients with osteoporosis are prone to falls and becoming disabled, and their cone fractures and hip fractures are very serious, so the diagnosis and treatment of osteoporosis is very urgent. Extracellular vesicles (EVs) are particles secreted from cells to the outside of the cell and they are wrapped in a bilayer of phospholipids. According to the size of the particles, they can be divided into three categories, namely exosomes, microvesicles, and apoptotic bodies. The diameter of exosomes is 30&ndash;150 nm, the diameter of microvesicles is 100&ndash;1000 nm, and the diameter of apoptotic bodies is about 50&ndash;5000 nm. EVs play an important role in various biological process and diseases including osteoporosis. In this review, the role of EVs in osteoporosis is systematically reviewed and some insights for the prevention and treatment of osteoporosis are provided